ICALP, EATCS and Maurice Nivat

40th Anniversary of EATCS

And we won, we were right. TCS is a very healthy branch of Computer Science, the number of researchers in the field and the number of published papers has increased by a huge coefficient (maybe 1000?). The association is still there, ICALP is organized regularly every year around the 14th of July, the journal TCS has grown tremendously from 400 pages a year to over 10000, each new page now cont...

Message from Academia Europaea

After EATCS was officially founded in 1972 the Bulletin issuer one was edited by Maurice Nivat in 73, issue two by Giorgio Ausiello in 76. I was elected EATCS Secretary and Bulletin editor at the 4 th ICALP (Turku, 1977) The regular appearance (three issues a year) was started by me with issue three: I am happy that some of the logo-design and structure that we introduced (particular the ideas ...

A note about minimal non-deterministic automata

With every rational language we associate a canonical non-determinis-tic automaton, that subsumes all possible \minimal" automata recognizing this language.

8 S ep 2 00 6 On a Problem Posed

Consider a m × n matrix A, whose elements are arbitrary integers. Consider, for each square window of size 2×2, the sum of the corresponding elements of A. These sums form a (m − 1) × (n − 1) matrix S. Can we efficiently (in polynomial time) restore the original matrix A given S? This problem was originally posed by Maurice Nivat for the case when the elements of matrix A are zeros and ones. We...

Sur les ensembles de mots infins engendrés par une grammaire algébrique